FURTHER GEOMETRIC RESTRICTIONS ON JORDAN STRUCTURE IN MATRIX FACTORIZATION
نویسندگان
چکیده
منابع مشابه
Further restrictions on the structure of finite CI-groups
A group G is called a CI-group if, for any subsets S, T ⊂ G, whenever two Cayley graphs Cay(G, S) and Cay(G, T ) are isomorphic, there exists an element σ ∈ Aut(G) such that S = T . The problem of seeking finite CI-groups is a longstanding open problem in the area of Cayley graphs. This paper contributes towards a complete classification of finite CI-groups. First it is shown that the Frobenius...
متن کاملNote on Matrix Factorization
A large portion of Linear algebra (scientific computing) is devoted to accelerate computationally intensive operations through the deeper understanding on the structure of the matrix. While it is not extremely hard to obtain an analytical solutions for the problems of interest, often a large-size matrix or repetetive nature of the computations prohibit us from getting the actual solution in num...
متن کاملA Purely Geometric Approach to Non-Negative Matrix Factorization
We analyze the geometry behind the problem of non-negative matrix factorization (NMF) and devise yet another NMF algorithm. In contrast to the vast majority of algorithms discussed in the literature, our approach does not involve any form of constrained gradient descent or alternating least squares procedures but is of purely geometric nature. In other words, it does not require advanced mathem...
متن کاملOn Jordan left derivations and generalized Jordan left derivations of matrix rings
Abstract. Let R be a 2-torsion free ring with identity. In this paper, first we prove that any Jordan left derivation (hence, any left derivation) on the full matrix ringMn(R) (n 2) is identically zero, and any generalized left derivation on this ring is a right centralizer. Next, we show that if R is also a prime ring and n 1, then any Jordan left derivation on the ring Tn(R) of all n×n uppe...
متن کاملOn Factorization of Integers with Restrictions on the Exponents
For a fixed k ∈ N we consider a multiplicative basis in N such that every n ∈ N has the unique factorization as product of elements from the basis with the exponents not exceeding k. We introduce the notion of k-multiplicativity of arithmetic functions, and study several arithmetic functions naturally defined in k-arithmetics. We study a generalized Euler function and prove analogs of the Wirsi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian-European Journal of Mathematics
سال: 2012
ISSN: 1793-5571,1793-7183
DOI: 10.1142/s1793557112500180